The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case
نویسندگان
چکیده
We solve the special case of the Euclidean Traveling Salesman Problem where II m cities lie on the boundary of the convex hull of all n cities, and the other m cities lie on a line segment inside this convex hull by an algorithm which needs O(mn) time and O(n) space.
منابع مشابه
A generalization of the convex-hull-and-line traveling salesman problem
Two instances of the traveling salesman problem, on the same node set (1,2 n} but with different cost matrices C and C , are equivalent iff there exist {a, hi:-1, n} such that for any 1 _ i, j _ n, j, C(i, j) C(i,j) q-at -bj [7]. One ofthe well-solved special cases of the traveling salesman problem (TSP) is the convex-hull-and-line TSP. We extend the solution scheme for this class of TSP given ...
متن کاملThe Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
In the uncapacitated asymmetric traveling salesman with multiple stacks, we perform a hamiltonian circuit to pick up n items, storing them in a vehicle with k stacks satisfying last-in-first-out constraints, and then we deliver every item by performing a hamiltonian circuit. We are interested in the convex hull of the (arc-)incidence vectors of such couples of hamiltonian circuits. For the gene...
متن کاملContribution théorique et numérique à la résolution du problème du Voyageur de Commerce. (Theoretical and numerical contribution for solving traveling salesman problem)
This dissertation is divided into two part, a theoretical one deals with the trave-ling salesman polytope, the convex hull of hamiltonian cycles, and a more numericalone in which we try to improve the “Branch and Cut” method for traveling salesmanproblem.The theoretical contribution consists in proving that the class of domino in-equalities is facet inducing for the trav...
متن کاملTraveling Salesman Problem
In this paper we present a fast approach for solving large scale Traveling Salesman Problems (TSPs). The heuristic is based on Delaunay Triangulation and its runtime is therefore bounded by O(n log n). The algorithm starts by construction the convex hull and successively replaces one edge with two new edges of the triangulation, thus inserting a new city. The decision which edge to remove is ba...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 51 شماره
صفحات -
تاریخ انتشار 1994